Stereo correspondence through feature grouping and maximal cliques
نویسندگان
چکیده
منابع مشابه
Stereo Correspondence Through Feature Grouping and Maximal Cliques
In this paper we propose a method to solve the stereo correspondence problem. The method matches features and feature relationships and can be paraphrased as follows. Linear edge segments are extracted from both the left and right images. Each such segment is characterized by its position and orientation in the image as well as its relationships with the nearby segments. A relational graph is t...
متن کاملInvariant Maximal Cliques and Incompleteness
The Invariant Maximal Clique Theorem asserts that every graph on Q[0,n] with a specific invariance condition has a maximal clique with another specific invariance condition. Here Q[0,n] consists of the rationals in the interval [0,n]. The invariance conditions are all given by equivalence relations involving only < on [0,n] and the distinguished elements 1,...,n. We prove the Invariant Maximal ...
متن کاملEquations , Maximal Cliques , and Graph Isomorphism
We present a new energy-minimization framework for the graph isomorphism problem which is based on an equivalent maximum clique formulation. The approach is centered around a fundamental result proved by Motzkin and Straus in the mid-1960s, and recently expanded in various ways, which allows us to formulate the maximum clique problem in terms of a standard quadratic program. The attractive feat...
متن کامل1 Invariant Maximal Cliques and Incompleteness
The Invariant Maximal Clique Theorem asserts that every graph on Q[0,n] with a specific invariance condition has a maximal clique with another specific invariance condition. Here Q[0,n] consists of the rationals in the interval [0,n]. The invariance conditions are all given by equivalence relations involving only < on [0,n] and the distinguished elements 1,...,n. We prove the Invariant Maximal ...
متن کاملReplicator Equations, Maximal Cliques, and Graph Isomorphism
We present a new energy-minimization framework for the graph isomorphism problem that is based on an equivalent maximum clique formulation. The approach is centered around a fundamental result proved by Motzkin and Straus in the mid-1960s, and recently expanded in various ways, which allows us to formulate the maximum clique problem in terms of a standard quadratic program. The attractive featu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 1989
ISSN: 0162-8828
DOI: 10.1109/34.42855